Position Paper on Scalability of Evolutionary Computation
نویسندگان
چکیده
We have been researching methods developed for designing behaviors and a directed cyclic graph for an optimized behavior selection mechanism for autonomous mobile robots to use in unoccupied aerial vehicles (UAVs) performing swarm based automatic target recognition. Our work is based on managing level of behavior, where behavior algorithms that are initially developed using evolutionary computing methods in a relatively lowfidelity, disembodied modeling environment can be migrated to high-level, dynamic, complex embodied applications. We will demonstrate our concept using adaptive waypoints, which allow navigation behaviors to be ported among autonomous mobile robots with incremental adaptation, different degrees of embodiment, and staged optimization. We believe our evolutionary algorithms scale to provide useful mission goal tasks.
منابع مشابه
A New Method for Geolocating of Radiation Sources Based on Evolutionary Computation of TDOA Equations
In this article a new method is introduced for geolocating of signal emitters which is based on evolutionary computation (EC) concept. In the proposed method two well-known members of EC techniques including Bees Algorithm (BA) and Genetic Algorithm (GA), are utilized to estimate the positions of emitters by optimizing the hyperbola equations which have been resulted from Time Difference of Arr...
متن کاملDynamic configuration and collaborative scheduling in supply chains based on scalable multi-agent architecture
Due to diversified and frequently changing demands from customers, technological advances and global competition, manufacturers rely on collaboration with their business partners to share costs, risks and expertise. How to take advantage of advancement of technologies to effectively support operations and create competitive advantage is critical for manufacturers to survive. To respond to these...
متن کاملEvolving Families of Designs Using L-Systems
Evolutionary computation has proven its utility in automating the process of engineering design. However, little attention has been paid to the scalability of generated designs, which is an important issue. This paper addresses this issue and proves the viability of evolving families of designs using parameterized L-Systems as a representation. The rest of the paper is organized as follows: fir...
متن کاملModification Point Depth and Genome Growth in Genetic Programming
The evolutionary computation community has shown increasing interest in arbitrary-length representations, particularly in the field of genetic programming. A serious stumbling block to the scalability of such representations has been bloat: uncontrolled genome growth during an evolutionary run. Bloat appears across the evolutionary computation spectrum, but genetic programming has given it by f...
متن کاملEfficient and Scalable Pareto Optimization by Evolutionary Local Selection Algorithms
Local selection is a simple selection scheme in evolutionary computation. Individual fitnesses are accumulated over time and compared to a fixed threshold, rather than to each other, to decide who gets to reproduce. Local selection, coupled with fitness functions stemming from the consumption of finite shared environmental resources, maintains diversity in a way similar to fitness sharing. Howe...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2004